Poresizes in random line networks
نویسندگان
چکیده
Many natural fibrous networks with fiber diameters much smaller than the average poresize can be described as three-dimensional (3D) random line networks. We consider here a ‘Mikado’ model for such systems, consisting of straight line segments of equal length, distributed homogeneously and isotropically in space. First, we derive analytically the probability density distribution p(rno) for the ‘nearest obstacle distance’ rno between a randomly chosen test point within the network pores and its closest neighboring point on a line segment. Second, we show that in the limit where the line segments are much longer than the typical pore size, p(rno) becomes a Rayleigh distribution. The single parameter σ of this Rayleigh distribution represents the most probable nearest obstacle distance and can be expressed in terms of the total line length per unit volume. Finally, we show by numerical simulations that σ differs only by a constant factor from the intuitive notion of average ‘pore size’, defined by finding the maximum sphere that fits into each pore and then averaging over the radii of these spheres.
منابع مشابه
Estimating the continuum of quasars using the articial neural networks
A lot of absorption lines are in the bluewards of Lyα emission line of quasar which is well-known as Lyαforest. Most of absorption lines in this forest belong to the Lyα absorption of the neutral hydrogen in the inter-galactic medium (IGM). For high redshift quasars and in the continuum with low and medium resolution, there are no many regions without absorption, so that, the quasar continuum i...
متن کاملGyroscope Random Drift Modeling, using Neural Networks, Fuzzy Neural and Traditional Time- series Methods
In this paper statistical and time series models are used for determining the random drift of a dynamically Tuned Gyroscope (DTG). This drift is compensated with optimal predictive transfer function. Also nonlinear neural-network and fuzzy-neural models are investigated for prediction and compensation of the random drift. Finally the different models are compared together and their advantages a...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملInvestigate The Relationship between Users' Perception of Social Networking with Collaborative Learning of Health Care Providers in The field of Thalassemia Prevention prevention
Background and Aim: Todays, various social networks such as Viber, WhatsApp, Telegram, Line and so on have affected all aspects of life. One of the most important benefits of these networks is their application in the education sector. The present study intends to investigate the relationship between userschr('39') perceptions of social networks and the collaborative learning of health care pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011